Weighted Polynomials and Weighted Pluripotential Theory
نویسنده
چکیده
X iv :m at h/ 06 10 33 0v 1 [ m at h. C V ] 1 0 O ct 2 00 6 From miranda Tue Oct 10 09:42:48 2006 Return-Path: ¡[email protected]¿ Received: miranda@localhost) by coxeter.math.toronto.edu (AIX5.2/8.11.6p2/8.11.0/UTMath 1.0) id k9ADgmn118742; Tue, 10 Oct 2006 09:42:48 -0400 Date: Tue, 10 Oct 2006 09:42:48 -0400 From: Miranda Tang ¡[email protected] Message-Id: ¡[email protected]¿To: [email protected] ject: your paper Cc: [email protected] Status: R WEIGHTED POLYNOMIALS AND WEIGHTED PLURIPOTENTIAL THEORY
منابع مشابه
m at h . C V ] 1 1 O ct 2 00 6 WEIGHTED POLYNOMIALS AND WEIGHTED PLURIPOTENTIAL THEORY
Let E be a compact subset of C and w ≥ 0 a weight function on E with w > 0 on a non-pluripolar subset of E. To (E, w) we associate a canonical circular set Z ⊂ C. We obtain precise relations between the weighted pluricomplex Green function and equilibrium measure of (E, w) and the pluricomplex Green function and equilibrium measure of Z. These results, combined with an appropriate form of the B...
متن کاملAn equivalent representation for weighted supremum norm on the upper half-plane
In this paper, rstly, we obtain some inequalities which estimates complex polynomials on the circles.Then, we use these estimates and a Moebius transformation to obtain the dual of this estimates forthe lines in upper half-plane. Finally, for an increasing weight on the upper half-plane withcertain properties and holomorphic functions f on the upper half-plane we obtain an equivalentrepresenta...
متن کاملWeighted quadrature rules with binomial nodes
In this paper, a new class of a weighted quadrature rule is represented as -------------------------------------------- where is a weight function, are interpolation nodes, are the corresponding weight coefficients and denotes the error term. The general form of interpolation nodes are considered as that and we obtain the explicit expressions of the coefficients using the q-...
متن کاملA Christoffel function weighted least squares algorithm for collocation approximations
We propose, theoretically investigate, and numerically validate an algorithm for the Monte Carlo solution of least-squares polynomial approximation problems in a collocation framework. Our investigation is motivated by applications in the collocation approximation of parametric functions, which frequently entails construction of surrogates via orthogonal polynomials. A standard Monte Carlo appr...
متن کاملOn the Total Weight of Weighted Matchings of Segment Graphs
We study the total weight of weighted matchings in segment graphs, which is related to a question concerning generalized Chebyshev polynomials introduced by Vauchassade de Chaumont and Viennot and, more recently, investigated by Kim and Zeng. We prove that weighted matchings with sufficiently large node-weight cannot have equal total weight.
متن کامل